See: Description
| Class | Description |
|---|---|
| BronKerboschBipartiteUtils |
Provides methods to mark graphs as bipartite using the basic Graph, Edge, and Node classes.
|
| BronKerboschHandler |
Code for finding maximal clique of a graph using the Bron-Kerbosch algorithm.
|
| Condition |
Represents a graph condition in memory.
|
| ConditionedGraph |
Represents a "conditioned" graph.
|
| Edge<D> |
Represents an Edge in memory.
|
| Graph |
Used to represent a graph in memory.
|
| Node |
Represents a node in memory.
|
| PrioritySet<T> |
Represents a PrioritySet.
|